Necessary conditions for the optimality of variable-rate residual vector quantizers
نویسندگان
چکیده
-Residual vector quantizatlon (RVQ), or multistage VQ, as it is also called, has recently been shown to be a competitive technique for data compression [1]. The competitive performance of RVQ reported in [1] results from the joint optimization of variable rate encoding and RVQ direct-sum codebooks. In this paper, necessary conditions for the optimality of variable rate RVQs are derived, and an iterative descent algorithm based on a Lagrangian formulation is introduced for designing RVQs having minimum average distortion subject to an entropy constraint. Simulation results for these entropy-constrained RVQs (EC-RVQs) are presented for memoryless Gaussian, Laplacian, and uniform sources. A Gauss-Markov source is also considered. The performance is superior to that of entropy-constrained scalar quantizers (EC-SQs) and practical entropy-constrained vector quantizers (EC-VQs), and is competitive with that of some of the best source coding techniques that have appeared in the literature. lndez Terms--Residual vector quantization, multistage vector quantization, entropy, source coding. "This work was supported in part by the National Science Foundation under contract MIP9116113 and by NASA.
منابع مشابه
Optimality conditions for approximate solutions of vector optimization problems with variable ordering structures
We consider nonconvex vector optimization problems with variable ordering structures in Banach spaces. Under certain boundedness and continuity properties we present necessary conditions for approximate solutions of these problems. Using a generic approach to subdifferentials we derive necessary conditions for approximate minimizers and approximately minimal solutions of vector optimizatio...
متن کاملLagrangian empirical design of variable-rate vector quantizers: consistency and convergence rates
The Lagrangian formulation of variable-rate vector quantization is known to yield useful necessary conditions for quantizer optimality and generalized Lloyd algorithms for quantizer design. In this correspondence, the Lagrangian formulation is demonstrated to provide a convenient framework for analyzing the empirical design of variable-rate vector quantizers. In particular, the consistency of e...
متن کاملSequential Optimality Conditions and Variational Inequalities
In recent years, sequential optimality conditions are frequently used for convergence of iterative methods to solve nonlinear constrained optimization problems. The sequential optimality conditions do not require any of the constraint qualications. In this paper, We present the necessary sequential complementary approximate Karush Kuhn Tucker (CAKKT) condition for a point to be a solution of a ...
متن کاملOptimality conditions for Pareto efficiency and proper ideal point in set-valued nonsmooth vector optimization using contingent cone
In this paper, we first present a new important property for Bouligand tangent cone (contingent cone) of a star-shaped set. We then establish optimality conditions for Pareto minima and proper ideal efficiencies in nonsmooth vector optimization problems by means of Bouligand tangent cone of image set, where the objective is generalized cone convex set-valued map, in general real normed spaces.
متن کاملConvex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 41 شماره
صفحات -
تاریخ انتشار 1995